Hector Geffner
101 publications
14 venues
H Index 38
Affiliation
RWTH Aachen University, GermanyLinks
| Name | Venue | Year | citations |
|---|---|---|---|
Learning Hierarchical Policies by Iteratively Reducing the Width of Sketch Rules.
|
KR | 2023 | 0 |
| Learning General Policies with Policy Gradient Methods.
|
KR | 2023 | 0 |
| Learning Generalized Policies without Supervision Using GNNs.
|
KR | 2022 | 1 |
| Target Languages (vs. Inductive Biases) for Learning to Act and Plan.
|
AAAI | 2022 | 0 |
| Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits.
|
ICAPS | 2022 | 0 |
| Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded Width.
|
ICAPS | 2022 | 0 |
| Flexible FOND Planning with Explicit Fairness Assumptions.
|
JAIR | 2022 | 0 |
| Flexible FOND Planning with Explicit Fairness Assumptions.
|
ICAPS | 2021 | 6 |
| Learning General Planning Policies from Small Examples Without Supervision.
|
AAAI | 2021 | 15 |
| General Policies, Representations, and Planning Width.
|
AAAI | 2021 | 10 |
| Expressing and Exploiting the Common Subgoal Structure of Classical Planning Domains Using Sketches.
|
KR | 2021 | 0 |
| Learning First-Order Representations for Planning from Black Box States: New Results.
|
KR | 2021 | 0 |
| High-level Programming via Generalized Planning and LTL Synthesis.
|
KR | 2020 | 9 |
| Learning First-Order Symbolic Representations for Planning from the Structure of the State Space.
|
ECAI | 2020 | 0 |
| Qualitative Numeric Planning: Reductions and Complexity.
|
JAIR | 2020 | 0 |
| Learning Features and Abstract Actions for Computing Generalized Plans.
|
AAAI | 2019 | 0 |
| Compact Policies for Fully Observable Non-Deterministic Planning as SAT.
|
ICAPS | 2018 | 23 |
| Features, Projections, and Representation Change for Generalized Planning.
|
IJCAI | 2018 | 30 |
| Model-free, Model-based, and General Intelligence.
|
IJCAI | 2018 | 48 |
| Planning With Pixels in (Almost) Real Time.
|
AAAI | 2018 | 21 |
| A Polynomial Planning Algorithm that Beats LAMA and FF.
|
ICAPS | 2017 | 27 |
| Multiagent Online Planning with Nested Beliefs and Dialogue.
|
ICAPS | 2017 | 18 |
| Improving Plan Quality through Heuristics for Guiding and Pruning the Search: A Study Using LAMA.
|
SOCS | 2017 | 2 |
| Best-First Width Search: Exploration and Exploitation in Classical Planning.
|
AAAI | 2017 | 77 |
| Generalized Planning: Non-Deterministic Abstractions and Trajectory Constraints.
|
IJCAI | 2017 | 34 |
| Purely Declarative Action Descriptions are Overrated: Classical Planning with Simulators.
|
IJCAI | 2017 | 42 |
| ∃-STRIPS: Existential Quantification in Planning and Constraint Satisfaction.
|
IJCAI | 2016 | 7 |
| Traps, Invariants, and Dead-Ends.
|
ICAPS | 2016 | 32 |
| Effective Planning with More Expressive Languages.
|
IJCAI | 2016 | 3 |
| Factored Probabilistic Belief Tracking.
|
IJCAI | 2016 | 5 |
| Beliefs In Multiagent Planning: From One Agent to Many.
|
ICAPS | 2015 | 83 |
| Policies that Generalize: Solving Many Planning Problems with the Same Policy.
|
IJCAI | 2015 | 20 |
| Classical Planning with Simulators: Results on the Atari Video Games.
|
IJCAI | 2015 | 80 |
| Modeling and Computation in Planning: Better Heuristics from More Expressive Languages.
|
ICAPS | 2015 | 35 |
| Width-Based Planning for General Video-Game Playing.
|
AIIDE | 2015 | 0 |
| Width-based Algorithms for Classical Planning: New Results.
|
ECAI | 2014 | 20 |
| Flexible and Scalable Partially Observable Planning with Linear Translations.
|
AAAI | 2014 | 13 |
| Belief Tracking for Planning with Sensing: Width, Complexity and Approximations.
|
JAIR | 2014 | 47 |
| Non-classical Planning with a Classical Planner: The Power of Transformations.
|
JELIA | 2014 | 5 |
| Causal Belief Decomposition for Planning with Sensing: Completeness Results and Practical Approximation.
|
IJCAI | 2013 | 6 |
| Fair LTL Synthesis for Non-Deterministic Systems using Strong Cyclic Planners.
|
IJCAI | 2013 | 40 |
| Width and Complexity of Belief Tracking in Non-Deterministic Conformant and Contingent Planning.
|
AAAI | 2012 | 12 |
| Action Selection for MDPs: Anytime AO* Versus UCT.
|
AAAI | 2012 | 43 |
| Width and Serialization of Classical Planning Problems.
|
ECAI | 2012 | 116 |
| Searching for Plans with Carefully Designed Probes.
|
ICAPS | 2011 | 72 |
| Computing Infinite Plans for LTL Goals Using a Classical Planner.
|
IJCAI | 2011 | 42 |
| Goal Recognition over POMDPs: Inferring the Intention of a POMDP Agent.
|
IJCAI | 2011 | 139 |
| Planning under Partial Observability by Classical Replanning: Theory and Experiments.
|
IJCAI | 2011 | 75 |
| Heuristic Search for Generalized Stochastic Shortest Path MDPs.
|
ICAPS | 2011 | 72 |
| Qualitative Numeric Planning.
|
AAAI | 2011 | 31 |
| Effective Heuristics and Belief Tracking for Planning with Incomplete Information.
|
ICAPS | 2011 | 22 |
| Inference and Learning in Planning.
|
ILP | 2011 | 0 |
| Automatic Derivation of Finite-State Machines for Behavior Control.
|
AAAI | 2010 | 27 |
| Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners.
|
AAAI | 2010 | 315 |
| The Model-Based Approach to Autonomous Behavior: A Personal View.
|
AAAI | 2010 | 15 |
| Compiling Uncertainty Away in Non-Deterministic Conformant Planning.
|
ECAI | 2010 | 24 |
| Soft Goals Can Be Compiled Away.
|
JAIR | 2009 | 106 |
| Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width.
|
JAIR | 2009 | 151 |
| Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics.
|
IJCAI | 2009 | 23 |
| A Translation-Based Approach to Contingent Planning.
|
IJCAI | 2009 | 139 |
| Solving POMDPs: RTDP-Bel vs. Point-based Algorithms.
|
IJCAI | 2009 | 116 |
| Plan Recognition as Planning.
|
IJCAI | 2009 | 291 |
| Inference and Decomposition in Planning Using Causal Consistent Chains.
|
ICAPS | 2009 | 16 |
| Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners.
|
ICAPS | 2009 | 110 |
| Heuristics for planning with penalties and rewards formulated in logic and computed through circuits.
|
Artificial Intelligence | 2008 | 16 |
| Unifying the Causal Graph and Additive Heuristics.
|
ICAPS | 2008 | 119 |
| Heuristics for Planning with Action Costs Revisited.
|
ECAI | 2008 | 113 |
| Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT.
|
CP | 2007 | 34 |
| From Conformant into Classical Planning: Efficient Translations that May Be Complete Too.
|
ICAPS | 2007 | 64 |
| Learning Depth-First Search: A Unified Approach to Heuristic Search in Deterministic and Non-Deterministic Settings, and Its Application to MDPs.
|
ICAPS | 2006 | 85 |
| Heuristics for Planning with Penalties and Rewards using Compiled Knowledge.
|
KR | 2006 | 24 |
| Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes).
|
AAAI | 2006 | 56 |
| Branching and pruning: An optimal temporal POCL planner based on constraint programming.
|
Artificial Intelligence | 2006 | 0 |
| mGPT: A Probabilistic Planner Based on Heuristic Search.
|
JAIR | 2005 | 103 |
| An Algorithm Better than AO*?
|
AAAI | 2005 | 31 |
| New Admissible Heuristics for Domain-Independent Planning.
|
AAAI | 2005 | 163 |
| Pruning Conformant Plans by Counting Models on Compiled d-DNNF Representations.
|
ICAPS | 2005 | 58 |
| Solving Simple Planning Problems with More Inference and No Search.
|
CP | 2005 | 34 |
| Search and Inference in AI Planning.
|
CP | 2005 | 2 |
| Planning Graphs and Knowledge Compilation.
|
ICAPS | 2004 | 13 |
| Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming.
|
AAAI | 2004 | 255 |
| Planning Graphs and Knowledge Compilation.
|
KR | 2004 | 0 |
| PDDL 2.1: Representation vs. Computation.
|
JAIR | 2003 | 12 |
| Faster Heuristic Search Algorithms for Planning with Uncertainty and Full Feedback.
|
IJCAI | 2003 | 128 |
| Labeled RTDP: Improving the Convergence of Real-Time Dynamic Programming.
|
ICAPS | 2003 | 356 |
| Branching Matters: Alternative Branching in Graphplan.
|
ICAPS | 2003 | 13 |
| Planning as heuristic search.
|
Artificial Intelligence | 2001 | 1107 |
| Learning Generalized Policies in Planning Using Concept Languages.
|
KR | 2000 | 78 |
| Independence in qualitative uncertainty frameworks.
|
KR | 2000 | 22 |
| Modeling Action, Knowledge and Control.
|
ECAI | 1998 | 33 |
| Learning Sorting and Decision Trees with POMDPs.
|
ICML | 1998 | 25 |
| Causality, Constraints and Indirect Effects.
|
IJCAI | 1997 | 6 |
| Arguing for Decisions: A Qualitative Model of Decision Making.
|
UAI | 1996 | 109 |
| Sound and Efficient Non-monotonic Inference.
|
IJCAI | 1995 | 0 |
| Causal Default Reasoning: Principles and Algorithms.
|
AAAI | 1994 | 6 |
| Conditional Entailment: Bridging two Approaches to Default Reasoning.
|
Artificial Intelligence | 1992 | 231 |
| Beyond Negation as Failure.
|
KR | 1991 | 20 |
| Causal Theories for Nonmonotonic Reasoning.
|
AAAI | 1990 | 65 |
| Default Reasoning, Minimality and Coherence.
|
KR | 1989 | 8 |
| On the Logic of Defaults.
|
AAAI | 1988 | 32 |
| An Improved Constraint-Propagation Algorithm for Diagnosis.
|
IJCAI | 1987 | 57 |